A Message Ordering Problem in Parallel Programs
نویسندگان
چکیده
We consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segments and propose a solution to minimize the completion time. With a sample parallel program, we experimentally evaluate the effect of the solution on a PC cluster.
منابع مشابه
Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملA Run-Time Performance Monitor for Message-Passing Parallel Programs
A fundamental problem with parallel program monitoring tools is the intrusiveness introduced by instrumenting a monitor into the original program for collecting trace data. An intrusive monitor may alter the order of program events and distort the timing information. This may result in a change in the probability of making particular non-deterministic choices, and thus change the program behavi...
متن کاملTimestamps in Message-Passing Systems That Preserve the Partial Ordering
Timestamping is a common method of totally ordering events in concurrent programs. However, for applications requiring access to the global state, a total ordering is inappropriate. This paper presents algorithms for timestamping events in both synchronous and asynchronous n1essage-passing programs that allow for access to the partial ordering inherent in a parallel system. The algorithms do no...
متن کاملOn Unifying Assumption { Commitment
Assumption{Commitment paradigms for speciication and veriication of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs 8, 12] which hitherto required diierent formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem 1].
متن کاملParallel Ordering Using Edge Contraction
Computing a ll-reducing ordering of a sparse matrix is a central problem in the solution of sparse linear systems using direct methods. In recent years, there has been signiicant research in developing a sparse direct solver suitable for message-passing multiprocessors. However, computing the ordering step in parallel remains a challenge and there are very few methods available. This paper desc...
متن کامل